Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards

An unrelated parallel machine scheduling problem motivated by the of a printed circuit board assembly (PCBA) under surface mount technology (SMT) is discussed in this paper. This involved eligibility restrictions, sequence-dependent setup times, precedence constraints, unequal job release and constraints shared resources with objectives minimizing makespan total tardiness. Since NP-hard, mathematical model was first built to describe problem, heuristic approach using non-dominated sorting genetic algorithm (NSGA-II) then designed solve bi-objective problem. Multiple near-optimal solutions were provided Pareto front solution crowding distance concepts. To demonstrate efficiency effectiveness proposed approach, study tested solving test problems on smaller scale. It found that could obtain optimal for small problems. A real set work orders production data famous hardware manufacturer Taiwan. The suggested Gantt charts visually assist planners make decisions. not only successfully improve planning time but also provide several feasible schedules equivalent performance choose from.